Superposition with Equivalence Reasoning and Delayed Clause Normal Form Transformation
نویسندگان
چکیده
منابع مشابه
Completeness of Resolution and Superposition Calculi
We modify Bezem’s [Be] completeness proof for ground resolution in order to deal with ordered resolution, redundancy, and equational reasoning in form of superposition. The resulting proof is completely independent of the cardinality of the set of clauses.
متن کاملHard Satisfiable Clause Sets for Benchmarking Equivalence Reasoning Techniques
A family of satisfiable benchmark instances in conjunctive normal form is introduced. The instances are constructed by transforming a random regular graph into a system of linear equations followed by clausification. Schemes for introducing nonlinearity to the instances are developed, making the instances suitable for benchmarking solvers with equivalence reasoning techniques. An extensive expe...
متن کاملReconstructing Solutions after Blocked Clause Elimination
Preprocessing has proven important in enabling efficient Boolean satisfiability (SAT) solving. For many real application scenarios of SAT it is important to be able to extract a full satisfying assignment for original SAT instances from a satisfying assignment for the instances after preprocessing. We show how such full solutions can be efficiently reconstructed from solutions to the conjunctiv...
متن کاملExtending SAT Solver with Parity Reasoning
Aalto University, P.O. Box 11000, FI-00076 Aalto www.aalto.fi Author Tero Laitinen Name of the doctoral dissertation Extending SAT Solver with Parity Reasoning Publisher School of Science Unit Department of Information and Computer Science Series Aalto University publication series DOCTORAL DISSERTATIONS 177/2014 Field of research Theoretical Computer Science Manuscript submitted 10 September 2...
متن کاملOn certain semigroups of transformations that preserve double direction equivalence
Let TX be the full transformation semigroups on the set X. For an equivalence E on X, let TE(X) = {α ∈ TX : ∀(x, y) ∈ E ⇔ (xα, yα) ∈ E}It is known that TE(X) is a subsemigroup of TX. In this paper, we discussthe Green's *-relations, certain *-ideal and certain Rees quotient semigroup for TE(X).
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Inf. Comput.
دوره 199 شماره
صفحات -
تاریخ انتشار 2003